-
1 recursion theorem
теорема о рекурсии
—
[ http://www.iks-media.ru/glossary/index.html?glossid=2400324]Тематики
- электросвязь, основные понятия
EN
теорема рекурсии
—
[Л.Г.Суменко. Англо-русский словарь по информационным технологиям. М.: ГП ЦНИИС, 2003.]Тематики
EN
Англо-русский словарь нормативно-технической терминологии > recursion theorem
-
2 recursion theorem
Большой англо-русский и русско-английский словарь > recursion theorem
-
3 recursion theorem
1) Математика: теорема о рекурсии2) Вычислительная техника: теорема рекурсии -
4 recursion theorem
мат. -
5 recursion theorem
-
6 double recursion theorem
Математика: теорема о парной рекурсииУниверсальный англо-русский словарь > double recursion theorem
-
7 double recursion theorem
English-Russian scientific dictionary > double recursion theorem
-
8 theorem
- analytical hierarchy theorem - arithmetical hierarchy theorem - closed range theorem - formally provable theorem - implicit function theorem - initial value theorem - integral representation theorem - local limit theorem - maximal ergodic theorem - mean value theorem - normal form theorem - ratio limit theorem - rational root theorem - second mean value theorem - theorem of consistency proofs - theorem of corresponding states - three line theorem - three series theorem - uniform convergence theorem - uniform ergodic theorem - uniform mean value theoremtheorem implies — из теоремы следует, что…
-
9 теорема о рекурсии
Большой англо-русский и русско-английский словарь > теорема о рекурсии
-
10 scheme
1) схема || составлять схему2) план; замысел || планировать, замышлять•- composite sampling scheme - decisive scheme - double sampling scheme - singly connected scheme -
11 formula
1. n формулаthey sought a formula that would allow settling of the dispute — они искали формулировку для разрешения спора
2. n рецепт3. n молочная смесь; детская смесь4. n догмат5. n шаблон, стереотипformula paintings — стандартные, шаблонные картины
6. n формула или классСинонимический ряд:1. established mode of speech (noun) code; credo; creed; custom; established mode of speech; protocol; ritual; ritualized speech; rote2. exact method (noun) blueprint; description; direction; exact method; guidelines; method; prescription; specifications3. symbolic representation (noun) chemical formula; empirical formula; equation; graphic formula; logarithm; ratio; recipe; symbolic representation; theorem
См. также в других словарях:
Recursion theorem — can refer to: * The recursion theorem in set theory * Kleene s recursion theorem, also called the fixed point theorem, in computability theory … Wikipedia
Kleene's recursion theorem — In computability theory, Kleene s recursion theorems are a pair of fundamental results about the application of computable functions to their own descriptions. The theorems were first proved by Stephen Kleene in 1938.This article uses the… … Wikipedia
Recursion — Recursion, in mathematics and computer science, is a method of defining functions in which the function being defined is applied within its own definition. The term is also used more generally to describe a process of repeating objects in a self… … Wikipedia
Recursion theory — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… … Wikipedia
Theorem — The Pythagorean theorem has at least 370 known proofs[1] In mathematics, a theorem is a statement that has been proven on the basis of previously established statements, such as other theorems, and previously accepted statements … Wikipedia
Fixed point theorem — In mathematics, a fixed point theorem is a result saying that a function F will have at least one fixed point (a point x for which F ( x ) = x ), under some conditions on F that can be stated in general terms. Results of this kind are amongst the … Wikipedia
Smn theorem — In computability theory the smn theorem, (also called the translation lemma, parameter theorem, or parameterization theorem) is a basic result about programming languages (and, more generally, Gödel numberings of the computable functions) (Soare… … Wikipedia
Alpha recursion theory — In recursion theory, the mathematical theory of computability, alpha recursion (often written α recursion) is a generalisation of recursion theory to subsets of admissible ordinals alpha. An admissible ordinal is closed under Sigma 1(L alpha)… … Wikipedia
Index set (recursion theory) — In the field of recursion theory, index sets describe classes of partial recursive functions, specifically they give all indices of functions in that class according to a fixed enumeration of partial recursive functions (a Gödel… … Wikipedia
Gödel's completeness theorem — is a fundamental theorem in mathematical logic that establishes a correspondence between semantic truth and syntactic provability in first order logic. It was first proved by Kurt Gödel in 1929. A first order formula is called logically valid if… … Wikipedia
Löwenheim–Skolem theorem — In mathematical logic, the Löwenheim–Skolem theorem, named for Leopold Löwenheim and Thoralf Skolem, states that if a countable first order theory has an infinite model, then for every infinite cardinal number κ it has a model of size κ. The… … Wikipedia
